Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value)

BM (Boyer-Moore) string matching algorithm and its enhanced versions like BMH and BMHS are a standard benchmark for single pattern string matching. Based on BMH and BMHS algorithms we have developed improved algorithms EBMH(Enhanced BMH)and EBMHS(Enhanced BMHS). These algorithms uses the newly introduced PDJ (possible double jump) and MValue(Match Value) concepts. While searching these concepts helps to provide longer jump of characters. The algorithm EBMH emphasize on BMH algorithm with the inclusion of PDJ and MValue and the algorithm EBMHS emphasize on BMHS algorithm with the inclusion of PDJ and MValue. Through these algorithm the number of comparison of characters between text and pattern are reduced to a significant amount. In this paper PDJ, MValue, EBMH and EBMHS are described and analyzed. Experimental results show that in the algorithms searching time is reduced as compared to BM, BMH, and BMHS. The algorithms are analyzed on the basis of time requirement in best, worst and average case.